<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>SystemSharp: SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt; Interface Template Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="logo.png"/></td>
  <td style="padding-left: 0.5em;">
   <div id="projectname">SystemSharp
   &#160;<span id="projectnumber">0.3</span>
   </div>
   <div id="projectbrief">A system-level modeling framework for designing real-time embedded systems</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Packages</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Class&#160;List</span></a></li>
      <li><a href="classes.html"><span>Class&#160;Index</span></a></li>
      <li><a href="hierarchy.html"><span>Class&#160;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Properties</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark">&#160;</span>Events</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="summary">
<a href="#properties">Properties</a> &#124;
<a href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4-members.html">List of all members</a>  </div>
  <div class="headertitle">
<div class="title">SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt; Interface Template Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p>Adapter interface to tree analysis algorithms.  
 <a href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#details">More...</a></p>
<div class="dynheader">
Inheritance diagram for SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;:</div>
<div class="dyncontent">
 <div class="center">
  <img src="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.png" usemap="#SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;_map" alt=""/>
  <map id="SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;_map" name="SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;_map">
<area href="class_system_sharp_1_1_tree_algorithms_1_1_default_tree_adapter_3_01_t_01_4.html" title="A default IGraphAdapter&lt;&gt; implementation, based on delegates. " alt="SystemSharp.TreeAlgorithms.DefaultTreeAdapter&lt; T &gt;" shape="rect" coords="0,56,336,80"/>
<area href="class_system_sharp_1_1_tree_algorithms_1_1_hashing_graph_adapter_3_01_t_01_4.html" title="A has map-based IGraphAdapter&lt;&gt; implementation. " alt="SystemSharp.TreeAlgorithms.HashingGraphAdapter&lt; T &gt;" shape="rect" coords="346,56,682,80"/>
</map>
 </div></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="properties"></a>
Properties</h2></td></tr>
<tr class="memitem:a9a2124ab0e5337b582e323a85c57717a"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a9a2124ab0e5337b582e323a85c57717a">Parent</a><code> [get]</code></td></tr>
<tr class="memdesc:a9a2124ab0e5337b582e323a85c57717a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the parent relation.  <a href="#a9a2124ab0e5337b582e323a85c57717a">More...</a><br/></td></tr>
<tr class="separator:a9a2124ab0e5337b582e323a85c57717a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a63b86f277d63fe8789f87b3a6764bb0d"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, T[]&gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a63b86f277d63fe8789f87b3a6764bb0d">Succs</a><code> [get]</code></td></tr>
<tr class="memdesc:a63b86f277d63fe8789f87b3a6764bb0d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the successor relation.  <a href="#a63b86f277d63fe8789f87b3a6764bb0d">More...</a><br/></td></tr>
<tr class="separator:a63b86f277d63fe8789f87b3a6764bb0d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac5094a9569eb65cf9756257b2365fcef"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, T[]&gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#ac5094a9569eb65cf9756257b2365fcef">Preds</a><code> [get]</code></td></tr>
<tr class="memdesc:ac5094a9569eb65cf9756257b2365fcef"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the predecessor relation.  <a href="#ac5094a9569eb65cf9756257b2365fcef">More...</a><br/></td></tr>
<tr class="separator:ac5094a9569eb65cf9756257b2365fcef"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2fe2209a5c1e9aa6a7047867fe2b14b5"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, List&lt; T &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a2fe2209a5c1e9aa6a7047867fe2b14b5">TempList</a><code> [get]</code></td></tr>
<tr class="memdesc:a2fe2209a5c1e9aa6a7047867fe2b14b5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on temporary list storage.  <a href="#a2fe2209a5c1e9aa6a7047867fe2b14b5">More...</a><br/></td></tr>
<tr class="separator:a2fe2209a5c1e9aa6a7047867fe2b14b5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a36f6608b8f6a225983e583641f09162b"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a36f6608b8f6a225983e583641f09162b">PreOrderIndex</a><code> [get]</code></td></tr>
<tr class="memdesc:a36f6608b8f6a225983e583641f09162b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the DFS pre-order index.  <a href="#a36f6608b8f6a225983e583641f09162b">More...</a><br/></td></tr>
<tr class="separator:a36f6608b8f6a225983e583641f09162b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6fb81481325ad20deab580399b506b79"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a6fb81481325ad20deab580399b506b79">PreOrderLast</a><code> [get]</code></td></tr>
<tr class="memdesc:a6fb81481325ad20deab580399b506b79"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the DFS pre-order last index, as defined by Havlak's loop analysis algorithm.  <a href="#a6fb81481325ad20deab580399b506b79">More...</a><br/></td></tr>
<tr class="separator:a6fb81481325ad20deab580399b506b79"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab14137488c89459fc9f9e55aa97e5e12"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#ab14137488c89459fc9f9e55aa97e5e12">PostOrderIndex</a><code> [get]</code></td></tr>
<tr class="memdesc:ab14137488c89459fc9f9e55aa97e5e12"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the DFS post-order index.  <a href="#ab14137488c89459fc9f9e55aa97e5e12">More...</a><br/></td></tr>
<tr class="separator:ab14137488c89459fc9f9e55aa97e5e12"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a765f8dfd35e901ac787d716f5f444380"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, <a class="el" href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34">ENodeType</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a765f8dfd35e901ac787d716f5f444380">Type</a><code> [get]</code></td></tr>
<tr class="memdesc:a765f8dfd35e901ac787d716f5f444380"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the node type, as defined by Havlak's loop analysis algorithm.  <a href="#a765f8dfd35e901ac787d716f5f444380">More...</a><br/></td></tr>
<tr class="separator:a765f8dfd35e901ac787d716f5f444380"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae5fc9d8317d8a8bebdffd7c31a7ba284"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, HashSet&lt; T &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#ae5fc9d8317d8a8bebdffd7c31a7ba284">BackPreds</a><code> [get]</code></td></tr>
<tr class="memdesc:ae5fc9d8317d8a8bebdffd7c31a7ba284"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the backPreds relation, as defined by Havlak's loop analysis algorithm.  <a href="#ae5fc9d8317d8a8bebdffd7c31a7ba284">More...</a><br/></td></tr>
<tr class="separator:ae5fc9d8317d8a8bebdffd7c31a7ba284"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac9227dcf40dd70b27317216bdc4a0557"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, HashSet&lt; T &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#ac9227dcf40dd70b27317216bdc4a0557">NonBackPreds</a><code> [get]</code></td></tr>
<tr class="memdesc:ac9227dcf40dd70b27317216bdc4a0557"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the nonBackPreds relation, as defined by Havlak's loop analysis algorithm.  <a href="#ac9227dcf40dd70b27317216bdc4a0557">More...</a><br/></td></tr>
<tr class="separator:ac9227dcf40dd70b27317216bdc4a0557"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac366abdfb293cd9dad2252c4a6302058"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, HashSet&lt; T &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#ac366abdfb293cd9dad2252c4a6302058">RedBackIn</a><code> [get]</code></td></tr>
<tr class="memdesc:ac366abdfb293cd9dad2252c4a6302058"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the redBackIn relation, as defined by Havlak's loop analysis algorithm.  <a href="#ac366abdfb293cd9dad2252c4a6302058">More...</a><br/></td></tr>
<tr class="separator:ac366abdfb293cd9dad2252c4a6302058"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a777dbec7591b5e2d8f7cd6e2633c8d1c"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, HashSet&lt; T &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a777dbec7591b5e2d8f7cd6e2633c8d1c">OtherIn</a><code> [get]</code></td></tr>
<tr class="memdesc:a777dbec7591b5e2d8f7cd6e2633c8d1c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the otherIn relation, as defined by Havlak's loop analysis algorithm.  <a href="#a777dbec7591b5e2d8f7cd6e2633c8d1c">More...</a><br/></td></tr>
<tr class="separator:a777dbec7591b5e2d8f7cd6e2633c8d1c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a96d7608ed8292ff90466c5949d29e6fc"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a96d7608ed8292ff90466c5949d29e6fc">Header</a><code> [get]</code></td></tr>
<tr class="memdesc:a96d7608ed8292ff90466c5949d29e6fc"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the loop header relation.  <a href="#a96d7608ed8292ff90466c5949d29e6fc">More...</a><br/></td></tr>
<tr class="separator:a96d7608ed8292ff90466c5949d29e6fc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a008d85ec9f1de991eb1e2ebfde3aac5c"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a008d85ec9f1de991eb1e2ebfde3aac5c">IDom</a><code> [get]</code></td></tr>
<tr class="memdesc:a008d85ec9f1de991eb1e2ebfde3aac5c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the immediate dominator.  <a href="#a008d85ec9f1de991eb1e2ebfde3aac5c">More...</a><br/></td></tr>
<tr class="separator:a008d85ec9f1de991eb1e2ebfde3aac5c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5a072da43a5d2205a1d9b16d4e324469"><td class="memItemLeft" align="right" valign="top">IPropMap&lt; T, T[]&gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html#a5a072da43a5d2205a1d9b16d4e324469">IDoms</a><code> [get]</code></td></tr>
<tr class="memdesc:a5a072da43a5d2205a1d9b16d4e324469"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a property map on the immediate dominatees.  <a href="#a5a072da43a5d2205a1d9b16d4e324469">More...</a><br/></td></tr>
<tr class="separator:a5a072da43a5d2205a1d9b16d4e324469"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Adapter interface to tree analysis algorithms. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
  <table class="tparams">
    <tr><td class="paramname">T</td><td>type of a vertex</td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00077">77</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>
</div><h2 class="groupheader">Property Documentation</h2>
<a class="anchor" id="ae5fc9d8317d8a8bebdffd7c31a7ba284"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, HashSet&lt;T&gt; &gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.BackPreds</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the backPreds relation, as defined by Havlak's loop analysis algorithm. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00122">122</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a96d7608ed8292ff90466c5949d29e6fc"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, T&gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.Header</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the loop header relation. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00142">142</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a008d85ec9f1de991eb1e2ebfde3aac5c"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, T&gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.IDom</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the immediate dominator. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00147">147</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a5a072da43a5d2205a1d9b16d4e324469"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, T[]&gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.IDoms</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the immediate dominatees. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00152">152</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="ac9227dcf40dd70b27317216bdc4a0557"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, HashSet&lt;T&gt; &gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.NonBackPreds</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the nonBackPreds relation, as defined by Havlak's loop analysis algorithm. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00127">127</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a777dbec7591b5e2d8f7cd6e2633c8d1c"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, HashSet&lt;T&gt; &gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.OtherIn</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the otherIn relation, as defined by Havlak's loop analysis algorithm. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00137">137</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a9a2124ab0e5337b582e323a85c57717a"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, T&gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.Parent</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the parent relation. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00082">82</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="ab14137488c89459fc9f9e55aa97e5e12"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, int&gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.PostOrderIndex</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the DFS post-order index. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00112">112</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="ac5094a9569eb65cf9756257b2365fcef"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, T[]&gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.Preds</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the predecessor relation. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00092">92</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a36f6608b8f6a225983e583641f09162b"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, int&gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.PreOrderIndex</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the DFS pre-order index. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00102">102</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a6fb81481325ad20deab580399b506b79"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, T&gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.PreOrderLast</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the DFS pre-order last index, as defined by Havlak's loop analysis algorithm. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00107">107</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="ac366abdfb293cd9dad2252c4a6302058"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, HashSet&lt;T&gt; &gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.RedBackIn</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the redBackIn relation, as defined by Havlak's loop analysis algorithm. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00132">132</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a63b86f277d63fe8789f87b3a6764bb0d"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, T[]&gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.Succs</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the successor relation. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00087">87</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a2fe2209a5c1e9aa6a7047867fe2b14b5"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, List&lt;T&gt; &gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.TempList</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on temporary list storage. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00097">97</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<a class="anchor" id="a765f8dfd35e901ac787d716f5f444380"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">IPropMap&lt;T, <a class="el" href="namespace_system_sharp_1_1_tree_algorithms.html#a42c198b43d26b1f8b998dd6ce93c8d34">ENodeType</a>&gt; SystemSharp.TreeAlgorithms.IGraphAdapter&lt; T &gt;.Type</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">get</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Returns a property map on the node type, as defined by Havlak's loop analysis algorithm. </p>

<p>Definition at line <a class="el" href="_tree_algorithms_8cs_source.html#l00117">117</a> of file <a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a>.</p>

</div>
</div>
<hr/>The documentation for this interface was generated from the following file:<ul>
<li><a class="el" href="_tree_algorithms_8cs_source.html">TreeAlgorithms.cs</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="namespace_system_sharp.html">SystemSharp</a></li><li class="navelem"><a class="el" href="namespace_system_sharp_1_1_tree_algorithms.html">TreeAlgorithms</a></li><li class="navelem"><a class="el" href="interface_system_sharp_1_1_tree_algorithms_1_1_i_graph_adapter_3_01_t_01_4.html">IGraphAdapter< T ></a></li>
    <li class="footer">Generated on Thu Dec 26 2013 14:22:22 for SystemSharp by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
  </ul>
</div>
</body>
</html>
